package DailyPractice.Day2;

import java.util.Scanner;

/**
 * @author lumin
 * @date 2022/04/18 19:52
 **/
public class Num1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n + 1];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }
        int num = 0;
        int i = 0;
        while(i < n) {
            if (arr[i] < arr[i + 1]) {
                while (i < n && arr[i] < arr[i + 1]) {
                    i++;
                }
                num++;
                i++;
            } else if (arr[i] == arr[i + 1]) {
                while (i < n && arr[i] == arr[i + 1]) {
                    i++;
                }
            } else {
                while (i < n && arr[i] > arr[i + 1]) {
                    i++;
                }
                num++;
                i++;
            }
        }
        System.out.println(num);
    }
}